Resultaten visas 1 - 10 / 2374
resultat / per sida
Vilka publikationsuppgifter finns i tjänsten?
Publikationens namn
Upphovspersoner
Publikationskanal
År
Publicationer information ikon

On the structure of optimal error-correcting codes

Referentgranskad
Östergård, P.R.J.
Discrete Mathematics1998Publicationer information ikon

Two new four-error-correcting binary codes

Referentgranskad
Östergård, Patric
Designs Codes and Cryptography2005Publicationer information ikon

New results on optimal error-correcting codes

Referentgranskad
Östergård, P.R.J.
IEEE1999Publicationer information ikon

Classification of binary/ternary one-error-correcting codes

Referentgranskad
Östergård, P.R.J.
Discrete Mathematics2000Publicationer information ikon

Error-correcting codes over an alphabet of four elements

Referentgranskad
Bogdanova, Galina T.; Brouwer, Andries E.; Kapralov, Stoian N.; Östergård, Patric R.J.
Designs Codes and Cryptography2001Publicationer information ikon

Binary two-error-correcting codes are better than quaternary

Referentgranskad
Östergård, P.R.J.
APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING2003Publicationer information ikon

On binary/ternary error-correcting codes with minimum distance 4

Referentgranskad
DOI
10.1007/3-540-46796-3_45
Östergård, P.R.J.
Lecture notes in computer science1999Publicationer information ikon

On the size of optimal three-error-correcting binary codes of length 16

Referentgranskad
DOI
10.1109/TIT.2011.2144955
Östergård, Patric R.J.
IEEE Transactions on Information Theory2011Publicationer information ikon

On optimal binary one-error-correcting codes of lengths 2^{m-4} and 2^{m-3}

Referentgranskad
DOI
10.1109/TIT.2011.2147758
Krotov, Denis S; Östergård, Patric R.J; Pottonen, Olli
IEEE Transactions on Information Theory2011Publicationer information ikon

Optimal binary one-error-correcting codes of length 10 have 72 codewords

Referentgranskad
Östergård, P.R.J.; Baicheva, T.; Kolev, E.
IEEE Transactions on Information Theory1999

On the structure of optimal error-correcting codes

Referentgranskad
1998

Two new four-error-correcting binary codes

Referentgranskad
2005

New results on optimal error-correcting codes

Referentgranskad
1999

Classification of binary/ternary one-error-correcting codes

Referentgranskad
2000

Error-correcting codes over an alphabet of four elements

Referentgranskad
2001

Binary two-error-correcting codes are better than quaternary

Referentgranskad
2003

On binary/ternary error-correcting codes with minimum distance 4

Referentgranskad
DOI
10.1007/3-540-46796-3_45
1999

On the size of optimal three-error-correcting binary codes of length 16

Referentgranskad
DOI
10.1109/TIT.2011.2144955
2011

On optimal binary one-error-correcting codes of lengths 2^{m-4} and 2^{m-3}

Referentgranskad
DOI
10.1109/TIT.2011.2147758
2011

Optimal binary one-error-correcting codes of length 10 have 72 codewords

Referentgranskad
1999